The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

eq(n__0, n__0) → true
eq(n__s(X), n__s(Y)) → eq(activate(X), activate(Y))
eq(X, Y) → false
inf(X) → cons(X, n__inf(n__s(X)))
take(0, X) → nil
take(s(X), cons(Y, L)) → cons(activate(Y), n__take(activate(X), activate(L)))
length(nil) → 0
length(cons(X, L)) → s(n__length(activate(L)))
0 → n__0
s(X) → n__s(X)
inf(X) → n__inf(X)
take(X1, X2) → n__take(X1, X2)
length(X) → n__length(X)
activate(n__0) → 0
activate(n__s(X)) → s(X)
activate(n__inf(X)) → inf(activate(X))
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__length(X)) → length(activate(X))
activate(X) → X

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

eq(n__0, n__0) → true
eq(n__s(X), n__s(Y)) → eq(activate(X), activate(Y))
eq(X, Y) → false
inf(X) → cons(X, n__inf(n__s(X)))
take(0', X) → nil
take(s(X), cons(Y, L)) → cons(activate(Y), n__take(activate(X), activate(L)))
length(nil) → 0'
length(cons(X, L)) → s(n__length(activate(L)))
0' → n__0
s(X) → n__s(X)
inf(X) → n__inf(X)
take(X1, X2) → n__take(X1, X2)
length(X) → n__length(X)
activate(n__0) → 0'
activate(n__s(X)) → s(X)
activate(n__inf(X)) → inf(activate(X))
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__length(X)) → length(activate(X))
activate(X) → X

S is empty.
Rewrite Strategy: FULL

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

TRS:
Rules:
eq(n__0, n__0) → true
eq(n__s(X), n__s(Y)) → eq(activate(X), activate(Y))
eq(X, Y) → false
inf(X) → cons(X, n__inf(n__s(X)))
take(0', X) → nil
take(s(X), cons(Y, L)) → cons(activate(Y), n__take(activate(X), activate(L)))
length(nil) → 0'
length(cons(X, L)) → s(n__length(activate(L)))
0' → n__0
s(X) → n__s(X)
inf(X) → n__inf(X)
take(X1, X2) → n__take(X1, X2)
length(X) → n__length(X)
activate(n__0) → 0'
activate(n__s(X)) → s(X)
activate(n__inf(X)) → inf(activate(X))
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__length(X)) → length(activate(X))
activate(X) → X

Types:
eq :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → true:false
n__0 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
true :: true:false
n__s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
activate :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
false :: true:false
inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
cons :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
0' :: n__0:n__s:n__inf:cons:nil:n__take:n__length
nil :: n__0:n__s:n__inf:cons:nil:n__take:n__length
s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
hole_true:false1_3 :: true:false
hole_n__0:n__s:n__inf:cons:nil:n__take:n__length2_3 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3 :: Nat → n__0:n__s:n__inf:cons:nil:n__take:n__length

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
eq, activate, length

They will be analysed ascendingly in the following order:
activate < eq
activate = length

(6) Obligation:

TRS:
Rules:
eq(n__0, n__0) → true
eq(n__s(X), n__s(Y)) → eq(activate(X), activate(Y))
eq(X, Y) → false
inf(X) → cons(X, n__inf(n__s(X)))
take(0', X) → nil
take(s(X), cons(Y, L)) → cons(activate(Y), n__take(activate(X), activate(L)))
length(nil) → 0'
length(cons(X, L)) → s(n__length(activate(L)))
0' → n__0
s(X) → n__s(X)
inf(X) → n__inf(X)
take(X1, X2) → n__take(X1, X2)
length(X) → n__length(X)
activate(n__0) → 0'
activate(n__s(X)) → s(X)
activate(n__inf(X)) → inf(activate(X))
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__length(X)) → length(activate(X))
activate(X) → X

Types:
eq :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → true:false
n__0 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
true :: true:false
n__s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
activate :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
false :: true:false
inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
cons :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
0' :: n__0:n__s:n__inf:cons:nil:n__take:n__length
nil :: n__0:n__s:n__inf:cons:nil:n__take:n__length
s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
hole_true:false1_3 :: true:false
hole_n__0:n__s:n__inf:cons:nil:n__take:n__length2_3 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3 :: Nat → n__0:n__s:n__inf:cons:nil:n__take:n__length

Generator Equations:
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(0) ⇔ n__0
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(x, 1)) ⇔ n__s(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(x))

The following defined symbols remain to be analysed:
length, eq, activate

They will be analysed ascendingly in the following order:
activate < eq
activate = length

(7) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol length.

(8) Obligation:

TRS:
Rules:
eq(n__0, n__0) → true
eq(n__s(X), n__s(Y)) → eq(activate(X), activate(Y))
eq(X, Y) → false
inf(X) → cons(X, n__inf(n__s(X)))
take(0', X) → nil
take(s(X), cons(Y, L)) → cons(activate(Y), n__take(activate(X), activate(L)))
length(nil) → 0'
length(cons(X, L)) → s(n__length(activate(L)))
0' → n__0
s(X) → n__s(X)
inf(X) → n__inf(X)
take(X1, X2) → n__take(X1, X2)
length(X) → n__length(X)
activate(n__0) → 0'
activate(n__s(X)) → s(X)
activate(n__inf(X)) → inf(activate(X))
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__length(X)) → length(activate(X))
activate(X) → X

Types:
eq :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → true:false
n__0 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
true :: true:false
n__s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
activate :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
false :: true:false
inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
cons :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
0' :: n__0:n__s:n__inf:cons:nil:n__take:n__length
nil :: n__0:n__s:n__inf:cons:nil:n__take:n__length
s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
hole_true:false1_3 :: true:false
hole_n__0:n__s:n__inf:cons:nil:n__take:n__length2_3 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3 :: Nat → n__0:n__s:n__inf:cons:nil:n__take:n__length

Generator Equations:
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(0) ⇔ n__0
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(x, 1)) ⇔ n__s(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(x))

The following defined symbols remain to be analysed:
activate, eq

They will be analysed ascendingly in the following order:
activate < eq
activate = length

(9) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol activate.

(10) Obligation:

TRS:
Rules:
eq(n__0, n__0) → true
eq(n__s(X), n__s(Y)) → eq(activate(X), activate(Y))
eq(X, Y) → false
inf(X) → cons(X, n__inf(n__s(X)))
take(0', X) → nil
take(s(X), cons(Y, L)) → cons(activate(Y), n__take(activate(X), activate(L)))
length(nil) → 0'
length(cons(X, L)) → s(n__length(activate(L)))
0' → n__0
s(X) → n__s(X)
inf(X) → n__inf(X)
take(X1, X2) → n__take(X1, X2)
length(X) → n__length(X)
activate(n__0) → 0'
activate(n__s(X)) → s(X)
activate(n__inf(X)) → inf(activate(X))
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__length(X)) → length(activate(X))
activate(X) → X

Types:
eq :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → true:false
n__0 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
true :: true:false
n__s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
activate :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
false :: true:false
inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
cons :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
0' :: n__0:n__s:n__inf:cons:nil:n__take:n__length
nil :: n__0:n__s:n__inf:cons:nil:n__take:n__length
s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
hole_true:false1_3 :: true:false
hole_n__0:n__s:n__inf:cons:nil:n__take:n__length2_3 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3 :: Nat → n__0:n__s:n__inf:cons:nil:n__take:n__length

Generator Equations:
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(0) ⇔ n__0
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(x, 1)) ⇔ n__s(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(x))

The following defined symbols remain to be analysed:
eq

(11) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
eq(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(1, n122_3)), gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(n122_3)) → false, rt ∈ Ω(1 + n122₃)

Induction Base:
eq(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(1, 0)), gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(0)) →_R^Ω(1)
false

Induction Step:
eq(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(1, +(n122_3, 1))), gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(n122_3, 1))) →_R^Ω(1)
eq(activate(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(1, n122_3))), activate(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(n122_3))) →_R^Ω(1)
eq(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(1, n122_3)), activate(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(n122_3))) →_R^Ω(1)
eq(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(1, n122_3)), gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(n122_3)) →_IH
false

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(12) Complex Obligation (BEST)

(13) Obligation:

TRS:
Rules:
eq(n__0, n__0) → true
eq(n__s(X), n__s(Y)) → eq(activate(X), activate(Y))
eq(X, Y) → false
inf(X) → cons(X, n__inf(n__s(X)))
take(0', X) → nil
take(s(X), cons(Y, L)) → cons(activate(Y), n__take(activate(X), activate(L)))
length(nil) → 0'
length(cons(X, L)) → s(n__length(activate(L)))
0' → n__0
s(X) → n__s(X)
inf(X) → n__inf(X)
take(X1, X2) → n__take(X1, X2)
length(X) → n__length(X)
activate(n__0) → 0'
activate(n__s(X)) → s(X)
activate(n__inf(X)) → inf(activate(X))
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__length(X)) → length(activate(X))
activate(X) → X

Types:
eq :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → true:false
n__0 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
true :: true:false
n__s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
activate :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
false :: true:false
inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
cons :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
0' :: n__0:n__s:n__inf:cons:nil:n__take:n__length
nil :: n__0:n__s:n__inf:cons:nil:n__take:n__length
s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
hole_true:false1_3 :: true:false
hole_n__0:n__s:n__inf:cons:nil:n__take:n__length2_3 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3 :: Nat → n__0:n__s:n__inf:cons:nil:n__take:n__length

Lemmas:
eq(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(1, n122_3)), gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(n122_3)) → false, rt ∈ Ω(1 + n122₃)

Generator Equations:
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(0) ⇔ n__0
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(x, 1)) ⇔ n__s(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(x))

No more defined symbols left to analyse.

(14) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
eq(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(1, n122_3)), gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(n122_3)) → false, rt ∈ Ω(1 + n122₃)

(15) BOUNDS(n^1, INF)

(16) Obligation:

TRS:
Rules:
eq(n__0, n__0) → true
eq(n__s(X), n__s(Y)) → eq(activate(X), activate(Y))
eq(X, Y) → false
inf(X) → cons(X, n__inf(n__s(X)))
take(0', X) → nil
take(s(X), cons(Y, L)) → cons(activate(Y), n__take(activate(X), activate(L)))
length(nil) → 0'
length(cons(X, L)) → s(n__length(activate(L)))
0' → n__0
s(X) → n__s(X)
inf(X) → n__inf(X)
take(X1, X2) → n__take(X1, X2)
length(X) → n__length(X)
activate(n__0) → 0'
activate(n__s(X)) → s(X)
activate(n__inf(X)) → inf(activate(X))
activate(n__take(X1, X2)) → take(activate(X1), activate(X2))
activate(n__length(X)) → length(activate(X))
activate(X) → X

Types:
eq :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → true:false
n__0 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
true :: true:false
n__s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
activate :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
false :: true:false
inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
cons :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__inf :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
0' :: n__0:n__s:n__inf:cons:nil:n__take:n__length
nil :: n__0:n__s:n__inf:cons:nil:n__take:n__length
s :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__take :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
n__length :: n__0:n__s:n__inf:cons:nil:n__take:n__length → n__0:n__s:n__inf:cons:nil:n__take:n__length
hole_true:false1_3 :: true:false
hole_n__0:n__s:n__inf:cons:nil:n__take:n__length2_3 :: n__0:n__s:n__inf:cons:nil:n__take:n__length
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3 :: Nat → n__0:n__s:n__inf:cons:nil:n__take:n__length

Lemmas:
eq(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(1, n122_3)), gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(n122_3)) → false, rt ∈ Ω(1 + n122₃)

Generator Equations:
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(0) ⇔ n__0
gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(x, 1)) ⇔ n__s(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(x))

No more defined symbols left to analyse.

(17) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
eq(gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(+(1, n122_3)), gen_n__0:n__s:n__inf:cons:nil:n__take:n__length3_3(n122_3)) → false, rt ∈ Ω(1 + n122₃)

(18) BOUNDS(n^1, INF)